Combining Sets with Elements
نویسنده
چکیده
We address the problem of combining decision procedures for sets with decision procedures for objects that are not (necessarily) sets. We present Nelson-Oppen-based and tableau-based combination methods, we prove their correctness, analyze their complexity, and we describe heuristics that aim for efficiency.
منابع مشابه
A hybrid filter-based feature selection method via hesitant fuzzy and rough sets concepts
High dimensional microarray datasets are difficult to classify since they have many features with small number ofinstances and imbalanced distribution of classes. This paper proposes a filter-based feature selection method to improvethe classification performance of microarray datasets by selecting the significant features. Combining the concepts ofrough sets, weighted rough set, fuzzy rough se...
متن کاملThe symmetric monoidal closed category of cpo $M$-sets
In this paper, we show that the category of directed complete posets with bottom elements (cpos) endowed with an action of a monoid $M$ on them forms a monoidal category. It is also proved that this category is symmetric closed.
متن کاملHesitant q-rung orthopair fuzzy aggregation operators with their applications in multi-criteria decision making
The aim of this manuscript is to present a new concept of hesitant q-rung orthopair fuzzy sets (Hq-ROFSs) by combining the concept of the q-ROFSs as well as Hesitant fuzzy sets. The proposed concept is the generalization of the fuzzy sets, intuitionistic fuzzy sets, hesitant fuzzy sets, and Pythagorean fuzzy sets as well as intuitionistic hesitant fuzzy sets (IHFSs) and hesitant Pythagorean fuz...
متن کاملσ-sporadic prime ideals and superficial elements
Let $A$ be a Noetherian ring, $I$ be an ideal of $A$ and $sigma$ be a semi-prime operation, different from the identity map on the set of all ideals of $A$. Results of Essan proved that the sets of associated prime ideals of $sigma(I^n)$, which denoted by $Ass(A/sigma(I^n))$, stabilize to $A_{sigma}(I)$. We give some properties of the sets $S^{sigma}_{n}(I)=Ass(A/sigma(I^n))setminus A_{sigma}(I...
متن کاملGranular Computing Based on Rough Sets, Quotient Space Theory, and Belief Functions
A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two operations, called zoomingin and zooming-out operations, are used to study connections between the elements of a universe and the elements of a granulated universe, as well as connections between computations in the two univer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003